منابع مشابه
On the structure of minimum broadcast digraphs
Broadcasting is a problem of information dissemination described in a group of individuals connected by a communication network, where one individual has an item of information and needs to communicate it to everyone else. This communication pattern nds its main applications in the eld of interconnection networks for parallel and distributed architecture. Numerous previous papers have investiga...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملMinimum Gossip Digraphs
Gossiping is a problem of information dissemination described in a group of individuals connected by a communication network, where every individual in the network knows a unique item of information and needs to communicate it to everyone else. This communication pattern nds its main applications in the eld of interconnection networks for parallel and distributed architecture. Previous papers h...
متن کاملMinimum Cost Homomorphisms of Digraphs
For digraphs D and H , a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). For a fixed directed or undirected graph H and an input graph D, the problem of verifying whether there exists a homomorphism of D to H has been studied in a large number of papers. We study an optimization version of this decision problem. Our optimization problem is motivated by ...
متن کاملDouble commutative-step digraphs with minimum diameters
From a natural generalization to E* of the concept of congruence, it is possible to define a family of 2-regular digraphs that we call double commutative-step digraphs. They turn out to be Cayley diagrams of Abelian groups generated by two elements, and can be represented by L-shaped tiles which tessellate the plane periodically. A double commutative-step digraph with n vertices is said to be t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90148-4